Valued constraint networks
نویسنده
چکیده
One of the limitation of the constraint network formalism lies in its inability of explicitly expressing a criteria to optimize. The introduction of several ad-hoc optimization mechanisms in constraint (logic) programming languages shows how important this restriction is. Several formalisms of varied generality have been proposed to remove this restriction: fuzzy constraint networks, partial constraint satisfaction, semi-ring constraint networks, valued constraint networks... In this paper, I shall introduce the valued constraint network formalism, why it has been designed and how it relates to comparable frameworks. The valued constraint network framework is the result of a compromise between generality and specificity. The generality aims at covering as many specific constraint optimization framework as possible, the specificity aims at accumulating enough properties in order to be able to build non trivial properties and generic algorithms. I will detail these properties and algorithms.
منابع مشابه
Lower semicontinuity for parametric set-valued vector equilibrium-like problems
A concept of weak $f$-property for a set-valued mapping is introduced, and then under some suitable assumptions, which do not involve any information about the solution set, the lower semicontinuity of the solution mapping to the parametric set-valued vector equilibrium-like problems are derived by using a density result and scalarization method, where the constraint set $K$...
متن کاملAn Overview of Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams
AND/OR Multi-valued Decision Diagrams (AOMDDs) combine the two frameworks of AND/OR search spaces and Multi-valued Decision Diagrams (MDDs) to create a framework that compiles a given graphical model into a smaller representation. AND/OR search spaces are an improved framework for search based inference algorithms for graphical models in general. The main idea is that it uses the underlying str...
متن کاملBounded Backtracking for the Valued Constraint Satisfaction Problems
We propose a new method for solving Valued Constraint Satisfaction Problems based both on backtracking techniques branch and bound and the notion of tree-decomposition of valued constraint networks. This mixed method aims to benefit from the practical efficiency of enumerative algorithms while providing a warranty of a bounded time complexity. Indeed the time complexity of our method is O(d ++1...
متن کاملSolving Constraint Optimization Problems in Anytime Contexts
This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valued CSP. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search and Limited Discrepancy Search with Constraint Propagation to efficiently guide the search. Experiments on the CELAR benchmarks demonstrate significant improvements ove...
متن کاملA General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming
For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints, we define a new gap function that generalizes the definitions of this concept in other articles. Then, we characterize the efficient, weakly efficient, and properly efficient solutions of the problem utilizing this new gap function. Our results are based on $(Phi,rho)-$invexity,...
متن کامل